Optimization of queries using relational algebraic theta-semijoin operator

ABSTRACT

A collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator is used to generate relational algebraic expressions equivalent to a computer programming language query. These expressions may be employed as a search space which is utilized by, for example, optimizing software or software that determines the equivalency of queries. Cost formulas for the multiset version of the theta-semijoin operator may be used in computing cost estimates for the generated expressions. Based on these computed cost estimates, the least costly implementation of a complex query is determined. Thus, queries are cost-based optimized on both a local and global basis by use of the relational algebraic theta-semijoin operator.

The present application claims priority to co-pending U.S. Provisional application Ser. No. 60/018,391 which was filed on May 29, 1996.

FIELD OF THE INVENTION

The invention relates generally to database management systems and in particular to the optimization of SQL queries.

BACKGROUND OF THE INVENTION

Relational database management systems are well-known in the art. In a relational database, information is structured in a collection of tables in which data values are stored in rows under various column headings. The Structured Query Language ("SQL") allows users to access databases maintained under any number of relational database management systems and has become the standard for relational database access.

Data is retrieved from the relational database by means of a SQL query, such as, in particular, a so-called SQL "SELECT" statement. A simple SQL SELECT statement may be of the form

SELECT specified field(s)

FROM specified table(s)

WHERE specified condition(s) is true.

For example, the query

SELECT name

FROM employees

WHERE sal=100

results in a list of the names of those employees earning $100, where "employees" is a table defined to include information about all employees of a particular company.

Other operations may be specified in, or result from, a SQL query. Some examples are as follows. Data from two or more tables may be combined in a "join" operation. "Views" can be derived from one or more so-called "base tables." Aggregates, e.g., such operators as SUM and COUNT, specify operations to be performed on the collection of values in some column of a table. The GROUP BY operator allows for tables to be grouped by any combination of their fields. Finally, SELECT statements may also be nested, thereby forming different types of subqueries.

Since any combination of such SQL operations as those above may be found in one SQL query, a SQL query may become quite complex, and, in fact, this complexity has increased as SQL queries have evolved over time. In particular, simple queries are typically "one block" queries, that is, they can be expressed with one SELECT statement having single FROM, WHERE, HAVING, and/or GROUPBY clauses. Simple queries have no subqueries or views. In contrast, a complex SQL query is composed of multiple blocks. An example of a complex SQL query is the so-called "decision-support" queries. Organizations have come to base decisions on results from these queries which are often defined using grouping/aggregation view relations and correlated subqueries (i.e., a subquery which is dependent upon some variable(s) whose value is determined in an "outer" query).

SQL queries express what results are requested but do not state how the results should be obtained. In other words, the query itself does not tell how the query should be evaluated by the relational data base management system. Rather, a component called the optimizer determines the "plan" or the best method--for example, in terms of I/O and CPU processing costs--of accessing the data to implement the SQL query.

Because of the potential complexity of SQL queries, query optimization, especially with respect to decision-support queries, has become very important. Different approaches to decision-support query optimization include the use of relational algebra and "magic sets rewriting".

Relational Algebra

Translating simple SQL queries into relational algebraic expressions is a well-known optimization technique. Generally speaking, a query is received by a database management system either interactively from a user or from a program in which the query is embedded. The optimizer or optimizing portion of the database management system either translates the query into a relational algebraic expression or receives the already-translated relational algebraic expression from another component of the database management system. In either case, once the SQL query is in the form of a relational algebraic expression, so-called "equivalence rules" transform the expression into other equivalent algebraic expressions, thereby generating a "search space" or "space", i.e., the number of different alternative implementations that an optimizer will consider.

Once the search space is generated, cost estimates for each algebraic expression can be generated by utilizing the cost formulas for the relational algebraic operators and the different ways of evaluating these operators. The estimated least costly alternative is then chosen as the plan. For example, a join of two relations (or tables) may be implemented by choosing one relation to be the "outer" relation and, for each tuple (or row) of that outer relation, finding all matching tuples of the other relation (called the "inner" relation). These matching tuples are then concatenated to the tuple of the outer relation. Although the actual cost for the join depends on the particular database system, determining the outer and inner relations, or using other methods to implement the join, may affect the estimated cost of performing the join.

Variations of the above technique can be used for the optimization of complex queries. For example, in one variation, a complex SQL query is broken into smaller blocks. These blocks are then translated to relational algebraic expressions to which the equivalence rules and the above procedure are applied. The result is that, for each block, the "optimal" alternative is determined. This is referred to as "local" optimization. However, the optimization of the interaction between the blocks, the so-called "global" optimization, is performed on an ad-hoc basis outside of the relational algebra framework.

The relational operator called the semijoin operator has been used in the prior art to optimize simple distributed queries for set semantics (i.e., queries whose results include no duplicate values). In particular, it is used to optimize joins of database relations in distributed database systems. Joins in distributed database systems are potentially costly operations because in such systems the data to be joined is resident at different sites, thereby incurring communication costs as well as processing costs. By first performing a semijoin, the processing site sends join information to a receiving site and only the data which would in fact join is determined at the receiving site. Since less data is transmitted from the receiving site to the processing site, the costs of communicating the data are thereby reduced.

Magic Sets Rewriting

To further improve the optimization process, the technique called "magic sets rewriting" is used to increase the search space. Magic sets rewriting optimizes complex SQL queries, such as view definitions and nested subqueries, by rewriting the queries more efficiently. Generally, the magic sets rewriting approach is to define a set of auxiliary "magic" (or "filter") relations that are used to filter out irrelevant or repetitive data that does not contribute to the results of the queries, for example, data which would not be used by subqueries. The most generalized form of magic set rewritings, called Constraint Magic rewriting, can handle non-equality conditions or predicates in queries, as well as equality predicates.

For any one query, there may be many different alternative rewritings. Generally, one or more of the rewritings are selected heuristically as those likely to have lower processing costs. The cost of processing the selected rewritings is compared with the cost of processing the query without the magic set rewrites, eventually choosing the least costly way. Although there have been recent efforts to provide cost-based techniques for selecting the most cost-effective rewriting (e.g., modeling magic sets rewriting as a special join method), magic sets rewriting generally remains a heuristic technique, with only a minimal cost-based component.

SUMMARY OF THE INVENTION

According to the principles of the present invention, a collection of equivalence (or transformation) rules involving the theta-semijoin operator is used, in addition to equivalence rules known in the prior art, to generate relational algebraic expressions that are equivalent to a SQL query. These expressions may be employed as a search space which is utilized by optimizing software or, alternatively, these expressions may be utilized by other types of software to, for example, determine the equivalency of queries. Further, the cost formulas provided herein for the multiset version of the theta-semijoin operator may be used, with the cost formulas for other multiset relational algebraic operators, to efficiently compute cost estimates for the generated expressions. Based on these computed cost estimates, the least costly implementation of a complex query is determined. Thus, SQL queries are cost-based optimized on both a local and global basis by use of the relational algebraic theta-semijoin operator. Since the semantics of SQL is based on multiset relations (where query results may include duplicate values), the multiset (bag) version of the theta-semijoin operator is used.

The addition of the equivalence rules of the invention to those known in the prior art results in a more extensive collection of equivalence rules from which a much larger search space for the optimizer is generated. Although the larger search space could result in an estimated less expensive plan being chosen by the optimizer, it could also increase the cost of the optimization itself. Therefore, according to a feature of this invention, heuristics are provided which, in preferred embodiments, restrict the applicability in certain cases of the equivalence rules that introduce the theta-semijoin operator.

There are several advantages provided by the invention. By using the theta-semijoin operator, embodiments of this invention provide for the optimization of certain queries that have not been optimized well using traditional optimization techniques. In particular, these queries include decision support queries, decision support queries, queries with aggregation views, queries with SELECT DISTINCT views, and queries with correlated subquery and outerjoins. Based on the disclosures in the prior art of which we are aware, the use of the semijoin operator has generally been restricted to set semantics and, further, has been used to address only equality conditions in SQL queries. We have discovered, however, that there need no longer be these restrictions. Rather, we have recognized that non-equality, as well as equality, conditions in multiset SQL queries or subqueries can be fully addressed in query optimization.

Moreover, the rule-based framework of the invention allows for its easy incorporation into existing cost-based optimizer generators that, given a collection of equivalence rules, generate an optimizer for a specific algebra (for example, the University of Colorado's so-called "Volcano").

Further, the principles of this invention are also applicable to the technique of magic sets rewriting because magic sets may be modeled by the relational algebraic operators provided for by the invention. As noted above, the magic set rewriting approach was heuristic in that, from among various ways of implementing magic sets, only one was arbitrarily chosen. In contrast, the equivalence rules of the present invention may be applied to any group of magic set rewritings such that the optimal implementation may be determined on a cost basis. Related to this concept is the invention discussed in our co-pending U.S. patent application, Ser. No. 08/862,906 in pending entitled "Effecting Constraint Magic Rewriting With the Theta-Semijoin Operator" and filed of even date herewith, in which Constraint Magic rewriting (an extension of Magic Set rewriting) is effectively generated for non-recursive queries.

Finally, unlike magic set rewriting, the invention works at the relational algebraic level, not the level of the SQL syntax, and can therefore be used for any version of SQL or, indeed, any other language translatable to relational algebra. Thus the principles of this invention are not limited to SQL queries but may be applied to queries of any language translatable to relational algebra.

BRIEF DESCRIPTION OF THE DRAWING

FIG. 1 illustrates an optimization technique used in the prior art.

FIG. 2 illustrates an embodiment of an optimization technique according to the principles of the invention.

FIG. 3 illustrates a computer environment for use in accordance with the invention.

FIG. 4 pictorially demonstrates the effective simulation of Constraint Magic rewriting.

DETAILED DESCRIPTION

Overview

FIG. 1 illustrates a simplified view of one prior art SQL query optimization technique. Upon receiving SQL query 10, optimizer 12 breaks down the query into any number of "blocks" 11 indicated as B1-B4. These blocks are then translated by a translation process 13 into relational algebraic expressions 14, indicated as R1-R4. A set of equivalence rules 15 are applied to each expression thereby generating, for each expression, a search space of equivalent relational algebraic expressions 16. These search spaces are indicated as S1-S4. Once each search space is generated, known cost estimates 17 for the various relational algebraic operators can be used to determine the optimal implementation 18 for that particular block, indicated as O1-O4. Finally, the optimizer determines the optimal interaction among blocks using certain heuristics 19, thereby producing plan 20. The latter is the method of accessing the data that will be used to implement the SQL query.

FIG. 2 illustrates an embodiment of an optimization technique according to the principles of the invention. A complex SQL query 10 is broken down into blocks 21, which are then translated by a translation process 22 into relational algebraic expressions 23. In contrast to the prior art technique described above, the "interrelationships" among the blocks 21 are also considered (as explained more fully hereinbelow) and expressed by using the theta semi-join operator. A set of equivalence rules consisting of the prior art equivalence rules 15 and the equivalence rules of the present invention 25 is used to generate search space 26. By considering not only blocks 21, but also the interrelationships among the blocks, in the relational algebraic expressions comprising search space 26, cost-based local and global optimizations are possible. Further, unlike the prior art technique of FIG. 1, search space 26 may be comprised of alternative implementations of the SQL query that address complexities such as correlated subqueries with inequality conditions in the WHERE clause.

Using the additional equivalence rules of the invention expands the search space considered by the optimizer from that which would have been generated in the prior art. Depending on the particular query, the consideration of a much larger search space may not be the most cost-effective technique. Therefore, a set of heuristics 24 is provided such that the use of the theta-semijoin operator will be restricted in certain circumstances.

Once the search space 26 is generated, cost estimates of the prior art relational algebraic operators 17 and the theta-semijoin cost estimates of the invention 28 are utilized to determine the optimal method of evaluating the SQL query 10, the plan 20.

Computer Environment

FIG. 3 illustrates an embodiment of a computer environment in which the invention may be used. In particular, the computer hardware environment includes processor 30 to which one or more electronic storage devices 36 and display terminal 35 may be connected. Processor 30 having a memory supports a relational data base management system (RDBMS) software 32 comprised of various software components including optimizer 34. The relational data bases and other related components (such as logging datasets) may reside on electronic storage devices 36 connected to processor 30. SQL queries may be input to the relational data base management system 32 interactively from user at display terminal 35 or by the batch execution of a computer software program 33 having embedded SQL statements. The queries, stored in memory, are thereafter operated upon by the relational data base management system, in particular, by the optimnizer in accordance with the features of the invention.

The equivalence rules and cost estimates provided by the invention may be stored in any physical medium, such as a computer diskette 37, for eventual input to optimizer generator software 38. The optimizer generator software 38 in turn generates the appropriate optimizer given the collection of rules and estimates. Alternatively, the rules and estimates may be input directly to the data base management system optimlzer if the optimizer is so-called "extensible" or designed to accept and utilize such input.

The following sections provide an in-depth consideration of the invention.

I. Illustrative Example

As discussed earlier, in a relational database, information is structured in tables (or relations) in which data values are stored in rows (or tuples). A SQL SELECT statement is used to retrieve information from the database. The fields to be selected are specified in the SELECT clause by either the field name (e.g., fielda) or by a name in which the table name and field name are concatenated (e.g., tableB.fieldA). The latter form may be used if there is more than one table containing fielda referenced in the FROM clause. A key may be defined for a table and generally acts as an index to that table.

To see how the use of the theta-semijoin transformations reduces the cost of answering a SQL query, consider the following example of an application where a supplier supplies many types of parts, each part having a given dollar value or cost (not to be confused with the above-discussed SQL query cost). The supplier has many warehouses. Each warehouse can store multiple types of parts, and each type of part can be stored in multiple warehouses. The relations are: Warehouse (LocId. Part, Quantity) and PartInfo (Part, Cost), where the underlined attributes form a key.

The supplier receives a set of requests for parts from a customer, as expressed by the relation Requests (Part, ReqQuantity, PriceLimit). Each row or tuple in the relation indicates the part, the required quantity and the maximum price per part the customer is willing to pay for the requested part. To determine which of the customer requests can be satisfied by the parts available in the warehouses, the supplier asks the following query Q1:

    ______________________________________                                         SELECT  Available.Part                                                         FROM    Requests, Available                                                    WHERE   Requests.Part = Available.Part AND Cost <= PriceLimit                          AND TotalQuantity >= ReqQuantity                                       ______________________________________                                    

where the view relation Available, defined below, contains information about the cost and total quantity of each part available in all the warehouses.

    ______________________________________                                         CREATE VIEW  Available (Part, Cost, TotalQuantity) AS                          SELECT       Warehouse.Part, Cost, SUM (Quantity)                              FROM         Warehouse, PartInfo                                               WHERE        Warehouse.Part = PartInfo.Part                                    GROUPBY      Warehouse.Part, Cost                                              ______________________________________                                    

Let us suppose that the supplier supplies 10,000 types of parts, has 20 warehouses, and stores each type of part in 10 warehouses on the average. Thus, the Warehouse relation has 100,000 tuples (i.e., 10 tuples for every type of part). The PartInfo relation has 10,000 tuples (i.e., one tuple for every type of part). Let us further suppose that the customer requests 100 types of parts, only 10 of which satisfy the condition PartInfo.Cost<=Requests.PriceLimit, and that the supplier can supply the required quantity of each type of part. The Requests relation therefore has 100 tuples.

The relative efficiency of evaluating the query in three cases can be compared: (a) the entire view Available is computed, and then joined with the Requests relation; (b) a view A1, obtained using magic sets is computed, and then joined with the 5 Requests relation; and (c) a view A2, obtained using theta-semijoin transformations, is computed, and then joined with the Requests relation. The comparison is performed using two metrics: (1) the number of tuples generated (as a result of joins, and grouping/aggregation), and (2) the number of tuples on which grouping/aggregation is performed. The greater the number of tuples in (1) and (2), the greater the processing cost associated with that particular method of evaluating the query.

In case (a), computing the entire view Available involves a join of the 10,000 tuples PartInfo relation with the 100,000 tuples Warehouse relation, resulting in a relation with 100,000 tuples. A grouping and aggregation is performed on this relation and the Available view has 10,000 tuples. The final join with the 100 tuple Requests relation results in computing 10 answers to the query Q1. A total of 110,010 (100,000+10,000+10) tuples are generated, and 100,000 tuples are grouped/aggregated.

In case (b), the magic sets rewriting optimnization technique calls for the computation of a view relation QueryAvailable(Part) called a "magic" or "query" relation. This view relation (which basically is the "parts" of the Requests relation) is used to restrict the computation of the view Available to generate only tuples that would be answers to the correlated queries on view Available, based on the equality Requests.Part=Available.Part. Since the Requests relation has 100 tuples, the QueryAvailable relation has 100 tuples as well. This is done by creating a specialized version A1 of the view Available (which references the view relation QueryAvailable) and by modifying query Q1 to use A1 instead of view Available.

It can be shown that computing view A1 involves a join of the 100 tuples QueryAvailable relation with the 10,000 tuples PartInfo relation, and the resulting 100 tuples intermediate result is joined with the 100,000 tuples Warehouse relation, resulting in a relation with 1000 tuples. A grouping and aggregation is performed on this relation and the A1 view relation has 100 tuples. The final join with the 100 tuple Requests relation results in computing 10 answers to the query Q1. A total of 1210 (100+1000+100+10) tuples are generated, and 1000 tuples are grouped/aggregated.

In case (c), the version A2 of the view Available is defined by using the theta-semijoin equivalence rules of the present invention. In contrast to the magic sets rewriting technique, the theta-semijoin equivalence rules consider the inequality condition "Cost<=PriceLimit" in addition to the equality condition "Requests.price=Warehouse.price". Applying both these conditions further reduces the set of tuples computed for the view relation Available--there are less tuples in version A2 than in magic set version A1--thereby significantly reducing the cost of query answering.

It can be shown that computing view A2 involves a join of the 100 tuples (projected) Requests relation with the 10,000 tuples Partlnfo relation. The resulting 10 tuples intermediate result is joined with the 100,000 tuples Warehouse relation, resulting in a relation with 100 tuples. A grouping and aggregation is performed on this relation, and the A2 view relation has 10 tuples. The final join with the 100 tuples Requests relation results in computing 10 answers to the query Q1. A total of 130 (10+100+10+10) tuples are generated, and 100 tuples are grouped/aggregated.

Thus, it can be seen that the use of the theta-semijoin equivalence rules considerably reduced the cost of answering the query. The size of the intermediate relations generated is reduced and the size of the inputs to the join and grouping/aggregation operations are reduced. In this case, the optimizer would select the relational algebraic expression of the query which utilizes the theta-semijoin operator as the least costly method of implementing the query.

II. Background and Definitions

The symbols R (with or without subscripts) are used to denote relations, θ (with or without subscripts) to denote quantifier-free predicates (i.e., conditions), E (with or without subscripts) to denote relational expressions, attrs(E) to denote the attributes of the result of E, and a to denote a tuple of attributes. Relations are treated as multisets of tuples, and hence the multiset version of relational algebra is used.

A grouping/aggregations operator is denoted by _(a) F.sub.ƒ, where a denotes the groupby attributes and ƒ denotes the aggregate operations performed on the groups defmed by the groupby attributes.

A. Definition of the Multiset θ-Semijoin

The multiset version of the θ-semijoin operator,.sub.θ, is defined as follows. Given relations R₁ and R₂, ##EQU1## where θ(t₂) denotes the condition θ with attributes of R₂ replaced by their values from tuple t₂.

The definition of θ-semijoin preserves the multiset semantics, i.e., the multiplicity of each tuple in the result is exactly the same as in R₁ ; each copy of tuple t₁ εR₁ is present in R₁ .sub.θ R₂ if and only if there exists a tuple t₂ εR₂ such that the pair of tuples t₁ and t₂ satisfies the condition θ. For example, if the relation R₁ (A, B) is the multiset of tuples {(1,2), (1,2), (1,4)}, and R₂ (C, D) is {(3, 5,), (3, 6), (3, 7)}, then R₁ _(C)≧B R₂ ={(1, 2), (1, 2)}.

In the multiset relational algebra, θ-semijoin is a derived operator, and can be expressed using the θ-join, projection (π) and duplicate elimination (δ) operators as follows: ##EQU2## where_(Nat) denotes natural join.

Some of the θ-semijoin transformation rules described make use of functional dependencies present in relations. The functional dependencies present in a relation R are denoted by F D(R). In addition, the transformations also make use of function dependencies implied by conditions (such as θ-join or θ-semijoin conditions). For example, the condition x=y*y implies the functional dependency {y}→x, and the condition x=y+z implies the functional dependencies {y, z}→x, {x, y}→z and {x, z}→y. The notation F D (θ) is used to denote the set of all functional dependencies implied by condition θ.

The first step in the optimization is a translation to extended relational algebra. The standard translation of SQL to extended relational algebra is used. An SQL block of the form

    ______________________________________                                         SELECT [DISTINCT]    attribute-list                                            FROM                 relation-list                                             WHERE                selection-preds                                           GROUPBY              groupby-attrs                                             ______________________________________                                    

is translated to ##EQU3## If the query does not have a GROUPBY clause, the groupby/aggregation operator is omitted, and if the DISTINCT is missing the δ operator is omitted.

B. Extended Relational Algebra

Extended relational algebra expressions E are generated by the following grammar.

    ______________________________________                                         E       ::=   R            relation name                                       ______________________________________                                                 |                                                                           σ.sub.θ (E)                                                                     multiset selection                                          |                                                                           .sub.a (E)   multiset projection                                         |                                                                           EE           multiset union                                              |                                                                           E - E        multiset difference                                         |                                                                           E ∩ E                                                                               multiset intersection                                       |                                                                           E.sub.θ E                                                                             multiset θ-join                                       |                                                                           E.sub.θ E                                                                             multiset θ-semijoin                                   |                                                                           E.sub.θ E                                                                             multiset left-outerjoin                                     |                                                                           E.sub.θ E                                                                             multiset right-outerjoin                                    |                                                                           E.sub.θ E                                                                             multiset full-outerjoin                                     |                                                                           .sub.a F.sub.f (E)                                                                          grouping/aggregation                                        |                                                                           δ(E)   duplicate elimination                               ______________________________________                                    

In keeping with the SQL semantics, multiset unionis defined additively, i.e., the cardinality of a tuple in the result is the sum of its cardinalities in each operand of. Multiset versions of intersection and difference also follow the SQL semantics. Note that cross-products and natural joins can be expressed using θ-joins.

C. Algebraic Summary of Constraint Magic Rewriting

This section presents a novel formulation, in algebraic notation, of the supplementary version of the Constraint Magic rewriting, which was originally presented as a source to source rewriting of Datalog rules. This formulation enables us to establish the connection between Constraint Magic rewriting and θ-semijoin transformations.

Given a set of view definitions, it is assumed that each view is used at most once. Consider a view V defined by: ##EQU4## If there is a set of queries on V of the form σ.sub.ψ.sbsb.i (V), where the conditions ψ_(i) are of the same form and differ only in the values of constants occuring in the ψ_(i), Constraint Magic rewriting starts from the top-level queries on V and is recursively applied on view relations that are used in the definition of V. Consider the rewriting of view V.

The first observation of Constraint Magic rewriting is that all the ψ_(i) 's can be represented by a parametrized condition ψ($c₁, . . . , $c_(m)), such that the ψ_(i) 's differ only in the values for the parameters $cj, 1≦j≦m. This set of queries can be represented by the parametrized condition ψ and the query relation Q_(V) ($c₁, . . . , $c_(m)) containing, for each ψ_(i) a tuple with values for the parameters defining ψ_(i).

Magic Sets rewriting deals with a restricted case where ψ is a conjunction of equality conditions of the form V.a_(i) =$cj; the attributes used in this conjunction are the "bound" attributes in the queries.

The second observation of Constraint Magic rewriting is that to answer the set of queries on V represented by (ψ, Q_(V)), it is not necessary to compute all of V. In fact, it suffices instead to use a version V' of V, defined as follows: ##EQU5## The use of V is then replaced by V'.

A novel contribution of this invention is the observation that parts of the semijoin condition can now be pushed into the join expression to filter out tuples from the results of intermediate joins, as well as from the relations (R₁, R₂, . . . R_(n)) that participate in the join.

The notation ψ^(i) is used to denote the portion of ψ that involves only attributes from R₁, . . . , R_(i) and Q_(V). We define supplementary relations S_(i), i≧1 as follows: ##EQU6##

The third observation of Constraint Magic (borrowed from Magic Sets) is that for each of the view relations R_(i), i≧1 used in defining V, the only tuples of R_(i) that need to be computed are those that can be used in the expression S_(i). For R₁, the required tuples are the answers to the set of queries represented by (ψ¹, query₋₋ R₁), where query₋₋ R₁ is defined as ##EQU7## For R_(i+1), i≧1, the required tuples are answers to the queries represented by (θ₁ ψ^(i+1), query₋₋ R_(i+1)), where query₋₋ R_(i+1) is defined as ##EQU8##

Note that the sets of queries on the R_(i) 's are in the same parametrized notation as the original queries on V. Hence, the same procedure may be applied recursively to restrict the evaluation of the view relations R_(i) 's to the relevant tuples. The rewriting terminates when there are no more view definitions to be processed. A final phase discards view definitions that are no longer reachable from the top-level query.

III. Transformation (or Equivalence Rules)

A. Basic θSemijoin Transformations:

Optimizing SQL queries by making use of θ-semijoins involves specifying equivalence rules involving θ-semijoins, and other operators of the extended multiset relational algebra. Given a collection of equivalence rules, a transformational optimizer can be used to enumerate and compactly represent the logical search space. In a subsequent phase, cost formulas for the operators in the algebra are used to efficiently compute cost estimates for different ways of evaluating the query, and choosing the optimal way (in the logical search space represented) of evaluating the query.

The transformations below require a renaming step when pushing conditions through algebraic operations, and when changing the structure of the expressions. For simplicity of exposition, this renaming step is ignored.

1. Introduction of θ-Semijoin: Relational algebra expressions generated directly from SQL queries typically do not contain the θ-semijoin operator (with the exception of using θ-semijoins only to handle HAVING clauses). Transformations 1a, 1b, 1c and 1d show how the θ-semijoin operator can be introduced into expressions with join, outerjoin, intersection and difference respectively. ##EQU9## A symmetric result holds for right-outerjoins. ##EQU10## where E₂ _(NAT) E₁ denotes the natural semijoin of E₂ with E₁. ##EQU11##

2. Pushing Selections through Semijoins: ##EQU12## where θ₁ involves only the attributes in attrs(E₁). ##EQU13## where θ₂ involves only the attributes in attrs (E₂).

3. Pushing/Introducing Projections: ##EQU14## where θ does not involve the attributes in attrs(E₁)-a. ##EQU15## where θ does not involve the attributes in attrs (E₂)-a.

4. Pushing/Introducing Duplicate Elimination: ##EQU16##

5. Pushing through Union, Intersection and Difference: ##EQU17## B. Complex θ-Semijoin Transformations:

1. Pushing θ-Semijoin through Joins: ##EQU18## where θ₂ involves only the attributes in attrs (E₂)∪attrs (E₃).

The symmetric rule for the case when θ₂ involves only the attributes in attrs(E₁)∪attrs (E₃) can be derived using the commutativity of θ-joins. ##EQU19##

A symmetric rule can be derived for pushing a semijoin into E₁ using commutativity of θ-joins. ##EQU20## where θ₁ involves only the attributes in attrs (E₁)∪attrs (E₂), and θ₂ involves only the attributes in attrs(E₁)∪attrs(E₃). Note that _(True) is equivalent to a cross-product.

2. Pushing θ-Semijoin through Outerjoins: ##EQU21## where θ₂ involves only the attributes in attrs(E₁)∪attrs(E₃).

3. Pushing θ-Semijoin through Grouping/Aggregation: ##EQU22## where θ involves only the attributes in a and attrs (E₂) ##EQU23## where θ involves only the attributes in E₁.a and attrs (E₂), and g(E₁.a, attrs(E₂)) is any function all of whose arguments are from E₁.a and attrs (E₂). A symmetric result holds for the case of max with ≧.

4. Introducing Aggregation for Subsumption: Transformation 11 shows conditions under which some of the tuples in the right operand of a θ-semijoin operator are redundant, and a grouping/aggregation operator can be introduced into the right operand to reduce its size. ##EQU24## where g is any function all of whose arguments are from the attributes E₂.xand attrs (E₁). A symmetric result holds for the case of min with ≧.

In the case where the function g(E₂.x,attrs(E₁)) is a single attribute of E₁, then the above transformation can be applied immediately after Transformation 10b.

C. Simplification/Elimination Transformations:

1. Splitting/Combining θ-Semijoins: ##EQU25## By transforming the LHS to the RHS, other transformations (e.g., Transformation 10a) may get enabled. By transforming the RHS to the LHS, a θ-semijoin can be eliminated.

2. Simplification: Some of the θ-semijoin transformations can generate expressions where some conditions are checked more than once. The repeated checks are necessary in general, but in some special cases the repeated checks are redundant, and the expressions can be simplified by removing them. Transformations 13a and 13b can be used to eliminate repeated checks, when they are applicable. ##EQU26## where attrs (E₂) functionally determine all the attributes in θ₂, under the functional dependencies F D(θ₁)∪F D(E₁). ##EQU27## where attrs(E₁) functionally determine all the attributes in θ₂, under the functional dependencies F D (θ₁)∪F D (E₂).

3. Eliminating θ-Semijoin: Intuitively, a θ-semijoin can be rewritten as a join followed by a projection if the join condition along with the functional dependencies of the right operand of the θ-semijoin guarantee that each tuple of the left operand is selected by at most one tuple of the right operand.

This intuition is formally captured by Transformation 14: ##EQU28## where E₂.y is a superkey of E₂, and g(attrs(E₁)) is a function of attributes of E₁ that returns a tuple of values with the same arity as E₂ y.

D. Complex Derived Transformations:

Some useful complex transformations can be derived using combinations of the transformations described so far. ##EQU29## where θ₁ involves only attributes in E₁.a and attrs(E₂). ##EQU30## where θ₁ involves only the attributes in attrs(E₁)∪attrs(E₃), and θ₂ involves only the attributes in attrs(E₂)∪attrs(E₃). ##EQU31##

The set of transformations described herein are extensive, but not exhaustive; under some special conditions, other transformations may be applicable. For instance, in the special case that whenever E₂ is empty, so is E₁, the expression E₁ _(True) E₂ is equivalent to E₁.

IV. θ-Semijoin Optimization of Complex SOL Queries

Decision support queries are quite complex, and are often defined using view relations (or table expressions), and correlated subqueries. When correlated subqueries are decorrelated, the resulting decorrelated query usually has view relations (equivalently, table expressions), and may contain outeijoin operators. When the FROM clause of an SQL query block includes view relations, traditionally query optimizers attempt to "merge" the definitions of the view relations into the blocks that use the view relations; join order optimization is then performed on each merged block separately; no inter-block query optimization is performed.

When the view relations have grouping and aggregation, or are defined using SELECT DISTINCT, the view definitions cannot be straightforwardly merged, in general, while preserving the SQL multiset semantics. Such views are expected to arise frequently in decision support applications.

The above-defined θ-semijoin transformations enable effective optimization of such complex SQL queries that are not optimized well using traditional cost-based optimization techniques. The rule-based framework allows optimization of such queries to be easily integrated with a cost-based optimizer.

A. Optimizing Queries with Aggregation Views

Consider an SQL query Q whose FROM clause includes multiple relations to be joined, one of which is a view relation defined using grouping and aggregation. Such a query can be represented in the extended relational algebra by the expression. ##EQU32##

For obvious reasons, the definition of E₂ cannot be merged into the definition of Q, to enable join order optimization. Previous techniques to optimize such expressions include Magic Sets, Predicate Movearound, and techniques that push groupby/aggregation operations through joins. The θ-semijoin transformations combine (and extend) the benefits of both Magic Sets and Predicate Movearound in an algebraic framework.

Suppose θ≡θ₁ θ₂, such that θ₁ is a conjunction of equality conditions of the form E₁.a=and E₂ a₂ and a₂ εg. Let a₁ denote the set of all such attributes of expression E₁ in θ₁. Magic Sets transformation first defines an auxiliary view: ##EQU33## Subsequently, the expression Q is transformed to ##EQU34##

The main limitation of Magic Sets is that it cannot use non-equality conditions in θ for optimizing the evaluation of E₂. Variants of Magic Sets, such as Extended Magic Sets, can additionally use inequality conditions of the form E₂.a₂ <c, where c is a constant, in some limited cases.

The effect of Predicate Movearound can also be understood algebraically. Suppose the join condition θ in Q is equivalent to θθ₄, such that θ₃ is an arbitrary condition involving attributes only of E₂ that are in g and some restricted kinds of attributes from ƒ. Then the expression Q is transformed to ##EQU35##

The main limitation of Predicate Movearound is that it cannot use conditions involving attributes from both E₁ and E₂.

The θ-semijoin transformations approach combines the benefits of both Magic Sets and Predicate Movearound, and can push arbitrary conditions in θ (not just equality conditions) involving attributes of both E₁ and E₂, for optimizing the evaluation of E₂. First, the θ-semijoin operator is introduced, based on the join condition θ, using Transformation 1a, and Q is transformed to ##EQU36##

Then, the θ-semijoin is pushed through the groupby/aggregation operator, to restrict the number of tuples of E₂ that participate in the grouping/aggregation to those that could subsequently join with E₁. The nature of the semijoin condition θ determines the result. When θ involves only attributes in g and attrs(E₁), Transformation 10 a can be used to transform Q to ##EQU37##

The intuition here is that, for each group of E₂, either all the tuples will be selected by (E₂ .sub.θ E₁), or none will. The tuple in the result of the F operator generated from each group will correspondingly be selected or not.

When θ involves results of the aggregation, the θ-semijoin operator cannot be pushed through aggregation in general. Transformation 10b identifies cases when it is possible to push the θ-semijoin operator through _(a) F.sub.ƒ. Further, when E₂ is a complex expression, e.g., a join expression, the semijoin can also be pushed into E₂ to optimize the evaluation of E₂.

Note that both equality and non-equality conditions, involving attributes of both E₁ and E₂, have been used for optimizing the evaluation of E₂. More importantly, the transformation rules used are algebraic equivalences, and a cost-based optimizer could choose from among the different (equivalent) algebraic expressions generated.

B. Optimizing Queries with SELECT DISTINCT Views

Consider an SQL query Q whose FROM clause includes multiple relations to be joined, one of which is a view relation defined using SELECT DISTINCT. Such a query can be represented in the extended relational algebra by the expression ##EQU38##

If the multiplicities of tuples is important for Q (e.g., it is used in an aggregation), and E₂ can have duplicates, the definition of view E₂ cannot be merged into the definition of Q. Previous techniques to optimize such expressions include the technique of pushing the duplicate elimination (8) operator through joins, by modeling the δ operator as a groupby on all the arguments, with no aggregation performed. This technique is not always applicable, whereas the θ-semijoin transformations can always be used here as described below. Moreover, the transformations can be combined with the optimizations of this technique cleanly within a transformation-based optimizer, so that the cheaper one gets chosen when both are applicable.

The effect of the θ-semijoin transformations on Q can be understood in two steps. In the first step, a new θ-semijoin operator is introduced, based on the join condition θ, using Transformation 1a. In the second step, the θ-semijoin is pushed through the duplicate elimination operator, using Transformation 4a, resulting in the expression ##EQU39##

The effect is to restrict the tuples of E₂ on which the expensive duplicate elimination needs to be performed to those that would subsequently join with E₁.

C. Optimizing Queries with Correlated Subqueries and Outerjoins

Consider an SQL query Q that includes a correlated subquery. For improving set-orientedness of evaluation, the query may be decorrelated. The resulting decorrelated query has view relations (or table expressions) in the FROM clause, and may contain outerjoin operators, e.g., the left-outerjoin operator .sub.θ. This is required by the semantics of correlated subqueries, especially in the presence of aggregate functions in the correlated subquery. Performing join-order optimization in the presence of outerjoins can be quite difficult, and traditional query optimizers often perform poorly on such complex queries.

The θ-semijoin transformations can be used to effectively optimize queries with outerjoin operators. In particular, the transformations can be used in conjunction with any technique for decorrelating a correlated subquery, to reduce the amount of irrelevant computation performed in evaluating the decorrelated view relation.

Consider an SQL query Q whose FROM clause includes multiple relations, at least one of which is a view relation, and some of the relations have to be left-outerjoined. Such a query can be represented in the extended relational algebra by the expression ##EQU40##

This query can be optimized, using Transformation 1b, to obtain the expression: ##EQU41##

When E₂ is a complex expression, Q can be further optimized using the techniques described herein.

An alternative decorrelation technique in the prior art, Magic Decorrelation, combines the advantages of Magic Sets with decorrelation. In effect, this technique computes an auxiliary view relation that contains the bindings that are used to invoke the correlated subquery, and the left-outerjoin is performed with the auxiliary relation as part of the definition of the decorrelated view relation. Magic Decorrelation can only use equality conditions; with non-equality conditions, using outerjoins would result in incorrect multiplicities.

Outerjoins can also be directly specified by the user in the FROM clause of the SQL query. When such outerjoins are specified in a view relation, θ-semijoin transformations can be used to optimize the evaluation of the view relation.

The θ-semijoin transformations do not have to be made heuristically; the transformation rules used are algebraic equivalences, and an optimizer could use cost estimates to choose from among the different (equivalent) algebraic expressions generated.

V. Cost Model for θ-semijoin

The costing phase of a transformational optimizer uses cost formulas for the operators in the algebra to efficiently compute cost estimates for the different ways of evaluating the query. This section describes how cost formulas for the θ-semijoin operator can be determined, assuming the availability of cost formulas for the other operators in the multiset relational algebra, in particular the θ-join.

The θ-semijoin operator is a derived operator in the extended multiset algebra, and can be expressed using the θ-join, projection (π) and duplicate elimination (δ) operators; implementing the θ-semijoin operator in this fashion is, however, quite inefficient.

The θ-semijoin operation R₁ .sub.θ R₂ can be efficiently implemented using minor changes to join techniques such as hash joins and index joins. One implementation treats the left operand R₁ of the θ-semijoin as the "outer" relation in the join technique. For each tuple in the outer relation R₁, instead of joining it with each matching tuple in the inner relation R₂, the tuple in R₁ can be returned as soon as a match is found. Sort-merge joins can similarly be adapted to implement θ-semijoins if the join condition is an equijoin.

An alternative implementation treats the right operand R₂ of the θ-semijoin as the "outer" relation in the join technique. For each tuple in the outer relation R₂, all matching tuples in the inner relation R₁ are returned. If a tuple in R₁ is already in the result as a consequence of matching a different R₂ tuple, it is not added to the result; an efficient implementation requires an index on the result of the θ-semijoin, in general. When the θ-semijoin condition involves an equijoin with a superkey of R₂, it is guaranteed that a tuple in R₁ matches at most one tuple in R₂ ; no index on the result of the θ-semijoin is required in this case. Using R₂ as the outer relation in the join algorithm as above is beneficial when, e.g., the right operand R₂ of the θ-semijoin is smaller than the left operand R₁.

The cost formulas for the different join techniques are easily modified to derive cost formulas for the different ways of implementing the θ-semijoin operator.

Approximate versions of the θ-semijoin operation can be efficiently implemented using Bloom filters, which are fixed size bit vectors. When the θ-semijoin condition is an equality condition, standard hashing techniques can be used to mark bits. For inequality conditions, possible options for marking bits include partitioning the domain of an attribute value and using a bit to represent each partition. This option is particularly useful when the θ-semijoin condition has been derived from a band join. Cost formulas for using Bloom filters can hence be used to derive the cost formulas for approximate versions of the θ-semijoin operator.

Several of the equivalence rules involving the θ-semijoin operator (e.g., Transformation 1a) introduce common subexpressions. The decision on whether to replicate the computation of the subexpressions, or to materialize the result of the subexpression and reuse the results, should be based on the relative cost estimates of the two approaches and is left to the cost-based optimizer. A useful heuristic is to materialize the results of common subexpressions and reuse the results wherever required. If the optimizer cannot explicitly deal with common subexpressions, it is straightforward to change the formulation of the equivalence rules to replace the subexpressions by a (temporarily) materialized relation, thereby performing common subexpression elimination at the level of the equivalence rules.

A. Heuristics for Cost-Based Optimization

A cost-based transformational optimizer extended with the θ-semijoin operator and our transformation rules would generate a superset of the query plans that the un-extended optimizer would generate. While this could result in a plan with a cheaper (estimated) cost being chosen by the extended optimizer, it could considerably increase the cost of query optimization by increasing the search space. This section discusses some heuristics that reduce the generated search space. It is desirable that these heuristics satisfy the following criteria:

1. The heuristics should not prune away algebraic expressions that optimize certain classes of SQL queries (for example, queries with aggregation views, queries with SELECT DISTINCT views, queries with correlated subqueries and outerjoins) that are not optimized well using traditional join-ordering optimizers.

2. For SQL queries that are optimized well using traditional join-ordering optimizers, the search space should not increase.

The following heuristics restrict the applicability of the transformation rules that introduce the θ-semijoin operator.

First, transformation 1a should be applied only when E₂ is of the form δ(E₃ ), or of one of the forms _(a) F.sub.ƒ (E₃ ) or π_(pa) (_(a_) F.sub.ƒ (E3 )).

The first case arises when the view in the FROM clause has a SELECT DISTINCT, and the latter cases arise when the view in the FROM clause has grouping and aggregation.

Second, transformations 1c and 1d should be used only when the size of the result of E₁ is smaller than that of E₂ on an order of magnitude (e.g., ten times or more smaller).

The transformation rules that introduce the θ-semijoin operator in the presence of outerjoins should be retained. This enables the optimization of the decorrelated view relations obtained from correlated subqueries.

These heuristics satisfy the above desired criteria. In particular, if the algebraic expression obtained from the query only has occurrences of the selection operator σ.sub.θ, the projection operator π_(a), and the join operator , the transformations do not add to the search space at all; traditional optimization techniques are adequate for such queries. Also, using these heuristics can considerably restrict the search space over unrestricted use of the transformation rules, for general SQL queries, since a typical query has far fewer occurrences of the grouping/aggregation operator, the duplicate elimination operator, and the outerjoin operators than it has of the join operator.

VI. θ-semijoin and Constraint Magic Rewriting

Magic rewritings optimize database queries by defining a set of auxiliary magic (or query) relations, that are used as filters to restrict computation of the query. Below is a derived transformation rule that captures the key intuition of Constraint Magic rewriting for a single join. Applying this transformation rule repeatedly on a sequence of joins has an effect similar to Constraint Magic rewriting, for a single block SQL query. A heuristic for applying the method of SQL queries that use view relations in addition to database relations is also included. The heuristic simulates the behavior of Constraint Magic rewriting on such queries.

A. CM Transformation Step Using θ-semijoin

The following transformation rule captures the basic step of Constraint Magic rewriting: ##EQU42## where θ₂ involves only the attributes in attrs (Q)U attrs(E₁), and E₁ and E₂ are defined below: ##EQU43## The above transformation is referred to as the Constraint Magic Transformation (CMT) Step and is shown pictorially as an algebraic equation graph in FIG. 4.

The CMT step is a derived transformation rule, and follows from an application of Transformation 12, commutativity of θ-joins, an application of Transformation 8a (to generate E₁), Transformation 8b (to generate the basic structure of E₂), Transformation 2c, and finally the transformation: σ.sub.θ.sbsb.2 (Q_(True) E1)≡Q.sub.θ.sbsb.2 E₁, which defines the θ-join. As with Transformations 18a and 18b, weaker versions of the join and semijoin conditions can be used to define El and E2 in the CMT step.

B. Connection of CMT Step and Constraint Magic Rewriting

The expressions defining E₁ and E₂ in the CMT step capture the essence of Constraint Magic rewriting. For example, suppose there is a set of queries Q on the result of a join of relations E₁ and E₂ In Constraint Magic rewriting of this join, the "query relation" (also called the "magic relation") Q is first used to restrict computation to E₁ to tuples relevant to Q. Then the set of E₁ tuples thus restricted are used along with the query Q to restrict computation of E₂. This strategy is exactly captured in the CMT step.

More formally, the connection can be established as follows. Consider a view defined as: ##EQU44## with a query relation Q, and a parametrized condition θ₂ θ₃ where θ₂ involves only the attributes in attrs(Q)U attrs(E₁). (This is the same as the LHS of the CMT step.) The Supplementary Constraint Magic rewriting first defmes supplementary relation S₁ below: ##EQU45## where E"₁ is the result of supplementary Constraint Magic rewriting of E₁ with the query relation Q and the parametrized condition θ₂. View V is then replaced by view V' defined below: ##EQU46## where E"₂ is the result of the supplementary Constraint Magic rewriting on E₂, with the query relation S₁, and the parametrized condition θ₁ θ₃.

The main difference between the Constraint Magic rewriting and the CMT step on a single join is that Constraint Magic rewriting uses θ-joins rather than θ-semijoins. Although the final expression using θ-semijoin is more complex than the definition of V' generated by Constraint Magic rewriting, the added complexity is required to preserve the multiset semantics.

C. CM Transformation of an SQL Block Using θ-semijoin

The algebraic expression V generated by transforming a single block SQL query is of the form: ##EQU47## Given a set of queries on V, denoted by V.sub.ψ Q, the following sequence of transformations can be applied to V.sub.ψ Q. First, identify the strongest subset of ψ, denoted by ψ_(n), that can be pushed through the groupby/aggregation operator. If the original query did not use GROUPBY, ψ_(n), is the same as ψ. Then,.sub.ψ.sbsb.n Q can be pushed inside the projection operator, using Transformation 3a (from RHS to LHS), and the groupby/aggregation operator, using either of Transformations 10a or 10b, whichever is applicable, to obtain: ##EQU48## Finally, the CMT step can be repeatedly applied on the expression ##EQU49## as described below. First define S_(i), i≧1, as follows: ##EQU50## Also, let ψ_(i), i<n denote the strongest subset of ψ_(i+1) that uses only attributes of Q and S_(i), and λ_(i), i<n denote the rest of ψ_(i+1). The first application of the CMT step transforms ##EQU51##

Now, consider S"_(n-1) ; the θ-semijoin can be pushed into the definition of S_(n-1) in exactly the same manner as above. Thus the CMT step is applied on each S_(i), n≧i≧2. Note that there are two occurrences of S'_(n-1), i.e., it is a common subexpression of two expressions. By using labeled expressions, the cost of optimizing and evaluating the expression twice is avoided. Using labeled expressions is very important to avoid an exponential blow up as we go down from S_(n) to S₁.

D. Heuristic CM Transformation of SQL Queries With Multiple Views

The θ-semijoin transformation of an SQL query block is performed. This block may contain uses of view relations, and after the transformation the use of a relation R_(i) may have a semijoin of the form R_(i) .sub.β.sbsb.i Q_(i), or R_(i) .sub.β.sbsb.i (Q.sub.γ.sbsb.n-1 '_(n-1)). Let E₁ denote the entire semijoin expression involving R_(i). If R_(i) is a view relation, a specialized version R'_(i) of the view definition of R_(i), with the semijoin pushed into it, can be created recursively using the θ-semijoin transformation of the SQL block defining R_(i). Finally, if all-of β_(i) can be pushed into the view definition of R_(i), then E_(i) is replaced by R'; else only R_(i) in E_(i) is replaced by R'_(i).

The relationship between the CMT step and Constraint Magic rewriting discussed earlier for a single join also carries over to the case of views, and to queries defined using multiple views.

Thus for SQL queries, the effect of Constraint Magic rewriting is obtained as a special case of the θ-semijoin transformations, in particular by using the CMT step. If the full space of equivalent expressions is explored, Constraint Magic rewriting will be examined as an option, and the cheapest expression in the search space will be chosen.

The foregoing merely illustrates the principles of the invention. For example, the features of the invention need not only be used for query optimization. Indeed, they may be utilized in any procedure requiring the determination of equivalent relational algebraic expressions.

It will thus be appreciated that those skilled in the art will be able to devise numerous and various alternative arrangements which, although not explicitly shown or described herein, embody the principles of the invention and are within its spirit and scope. 

We claim:
 1. A method comprising the steps ofreceiving a computer programming language database system query; generating at least one relational algebraic expression in response to said query by employing at least one of a collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator; selecting at least one of said relational algebraic expressions; and accessing said computer programming language database based on said selected expression.
 2. The method of claim 1 wherein said selecting comprises the step of estimating processing costs for at least one of said expressions.
 3. The method of claim 2 wherein said selecting is based on said estimated processing costs.
 4. The method of claim 1 wherein said computer programming language is SQL.
 5. The method of claim 4 wherein said query is selected from the group consisting of queries with aggregation views, queries with SELECT DISTINCT views, and queries with correlated subqueries and outerjoins.
 6. The method of claim 4 wherein said query is selected from the group consisting of queries with views and queries with subqueries.
 7. The method of claim I wherein said query is a decision support query.
 8. The method of claim 4 wherein said query is at least one magic set rewriting of a second computer programming language database query.
 9. A computer programming language query optimizer comprisingmeans for receiving a computer database language query; and means for generating at least one relational algebraic expression by employing at least one equivalence rule involving the multiset version of the relational algebraic theta-semijoin operator, said expression being equivalent to said query.
 10. A computer processor programmed to perform method steps for optimizing an SQL query, said method steps comprisinggenerating at least one relational algebraic expression by employing at least one equivalence rule involving the multiset version of the relational algebraic theta-semijoin operator, said expression equivalent to said query; and performing cost-based algebraic optimization of said algebraic expressions, said cost-based algebraic optimization using at least one cost formula for said theta-semijoin operator.
 11. A program storage device embodying a computer program to perform method steps comprising:receiving an SQL query; and generating at least one relational algebraic expression by employing at least one equivalence rule involving the multiset version of the relational algebraic theta-semijoin operator, said expression equivalent to said SQL query.
 12. A storage device embodying a collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator, said rules input to software employing relational algebraic expressions, said expressions responsive to a computer language database query.
 13. A method of optimizing a computer programming language query, the improvement comprising the steps ofreceiving said query, generating a search space, said search space comprised of at least one relational algebraic expression equivalent to said query, said expression involving the multiset version of the theta-semijoin operator; and optimizing said query by estimating cost for said expression.
 14. A method of retrieving information from a computer database comprising the steps ofreceiving a computer database language query; translating said query into a first relational algebraic expression; generating at least one relational algebraic expression in response to said first relational algebraic expression by employing at least one equivalence rule involving the multiset version of the theta-semijoin; generating a cost estimate for each of said expressions by employing at least one cost formula for said theta-semijoin operator; selecting one of said expressions, said selection based on said generated cost estimates; and employing said selected expression to retrieve said information from said database.
 15. A method comprising the steps ofreceiving at least a first and a second computer database language queries; generating at least one relational algebraic expression for each said query by employing at least one equivalence rule involving the multiset version of the theta-semijoin operator; and determining equivalency of any of said generated relational algebraic expressions from said first query to said generated relational algebraic expressions of said second query.
 16. An apparatus for determining equivalence of SQL queries, comprisingmeans for accepting at least two SQL queries; and means for generating at least one relational algebraic expression by employing at least one equivalence rule involving the multiset version of the theta-semijoin operator, said generated expressions equivalent to respective queries.
 17. A method comprising the steps ofreceiving a computer programming language database system query; generating at least one relational algebraic expression in response to said query by employing at least one of a collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator; selecting at least one of said relational algebraic expressions; and accessing said computer programming language database based on said selected expression, said multiset version defined as ##EQU52## where R1 and R2 denote relations, and θ(t₂) denotes the predicate θ with attributes of R₂ replaced by their values from tuple t₂.
 18. The method of claim 17 wherein said collection includes equivalence rule ##EQU53## where E (with or without subscripts) denotes relational expressions, θ (with or without subscripts) denotes predicates,.sub.θ denotes the θ-join operator, and .sub.θ denotes the θ-semijoin operator.
 19. The method of claim 17 wherein said collection includes equivalence rule ##EQU54## E (with or without subscripts) denotes relational expressions, θ (with or without subscripts) denotes predicates, .sub.θ denotes the θ-join operator, and .sub.θ denotes the θ-semijoin operator.
 20. The method of claim 17 wherein said collection includes equivalence rule ##EQU55## where E (with or without subscripts) denotes relational expressions, θ (with or without subscripts) denotes predicates, .sub.θ denotes the θ-join operator, .sub.θ denotes the θ-semijoin operator, _(g) F_(f) denotes a grouping/aggregation operator, and θ involves only the attributes in a and attrs (E₂).
 21. A storage device embodying a collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator, said rules input to software employing relational algebraic expressions, said expressions responsive to a computer language database query, said multiset version defined as ##EQU56## where R1 and R2 denote relations, θ(t₂) denotes the predicate θ with attributes of R₂ replaced by their values from tuple t₂.
 22. A storage device embodying a collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator, said rules input to software employing relational algebraic expressions, said expressions responsive to a computer language database query, said rules including rule ##EQU57## where E (with or without subscripts) denotes relational expressions, θ (with or without subscripts) denotes predicates, .sub.θ denotes the θ-join operator, and .sub.θ denotes the θ-semijoin operator. 